A Lean-Congruence Format for EP-Bisimilarity
نویسندگان
چکیده
Enabling preserving bisimilarity is a refinement of strong that preserves safety as well liveness properties. To define it properly, labelled transition systems needed to be upgraded with successor relation, capturing concurrency between transitions enabled in the same state. We enrich well-known De Simone format handle inductive definitions this relation. then establish ep-bisimilarity congruence for operators, lean recursion, all (enriched) languages.
منابع مشابه
Is Timed Branching Bisimilarity a Congruence Indeed?
We show that timed branching bisimilarity as defined by Van der Zwaag [17] and Baeten and Middelburg [2] is not an equivalence relation, in case of a dense time domain. We propose an adaptation based on Van der Zwaag’s definition, and prove that the resulting timed branching bisimilarity is an equivalence indeed. Furthermore, we prove that in case of a discrete time domain, Van der Zwaag’s defi...
متن کاملA Congruence Format for Name-passing Calculi
We define and use a SOS-based framework to specify the transition systems of calculi with name-passing properties. This setting uses proof-theoretic tools to take care of some of the difficulties specific to name-binding and make them easier to handle in proofs. The contribution of this paper is the presentation of a format that ensures that open bisimilarity is a congruence for calculi specifi...
متن کاملA Pre-congruence Format for XY-simulation
XY -simulation is a generalization of bisimulation that is parameterized with two subsets of actions. XY -simulation is known in the literature under different names such as modal refinement, partial bisimulation, and alternating simulation. In this paper, we propose a precongruence rule format for XY -simulation. The format allows for checking compositionality of XY -simulation for an arbitrar...
متن کاملRelations among quantum processes: bisimilarity and congruence
Full formal descriptions of algorithms making use of quantum principles must take into account both quantum and classical computing components, as well as communications between these components. Moreover, to model concurrent and distributed quantum computations and quantum communication protocols, communications over quantum channels which move qubits physically from one place to another must ...
متن کاملRooted Divergence-Preserving Branching Bisimilarity is a Congruence
We prove that rooted divergence-preserving branching bisimilarity is a congruence for the process specification language consisting of 0, action prefix, choice, and the recursion construct μX. .
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic proceedings in theoretical computer science
سال: 2023
ISSN: ['2075-2180']
DOI: https://doi.org/10.4204/eptcs.387.6